SGCM: The Sophie Germain Counter Mode
نویسنده
چکیده
Sophie Germain Counter Mode (SGCM) is an authenticated encryption mode of operation, to be used with 128-bit block ciphers such as AES. SGCM is a variant of the NIST standardized Galois / Counter Mode (GCM) which has been found to be susceptible to weak key / short cycle forgery attacks. The GCM attacks are made possible by its extremely smooth-order multiplicative group which splits into 512 subgroups. Instead of GCM’s GF (2), we use GF (p) with p = 2+12451, where p−1 2 is also a prime. SGCM is intended for those who want a concrete, largely technically compatible alternative to GCM. In this memo we give a technical specification of SGCM, together with some elements of its implementation, security and performance analysis. Test vectors are also included.
منابع مشابه
The power digraphs of safe primes
A power digraph, denoted by $G(n,k)$, is a directed graph with $Z_{n}={0,1,..., n-1}$ as the set of vertices and $L={(x,y):x^{k}equiv y~(bmod , n)}$ as the edge set, where $n$ and $k$ are any positive integers. In this paper, the structure of $G(2q+1,k)$, where $q$ is a Sophie Germain prime is investigated. The primality tests for the integers of the form $n=2q+1$ are established in terms of th...
متن کاملParallel Computation of Large-Scale Dynamic Optimal Power Flow Problems
In this paper, a novel approach is presented to compute large Dynamic Optimal Power Flow (DOPF) problems in a distributed computing architecture, referred to as a Smart Grid Communication Middleware (SGCM) system. The time horizon is split into shorter time intervals using the SGCM system to solve one iteration of the Primal Dual Interior Point Method (PDIPM) for each sub-problem in parallel. T...
متن کاملLarge Sophie Germain primes
If P is a prime and 2P+1 is also prime, then P is a Sophie Germain prime. In this article several new Sophie Germain primes are reported, which are the largest known at this time. The search method and the expected search times are discussed.
متن کاملSophie ’ s Diary
Can a ctional teenage diary of the mathematician Sophie Germain have dramatic and captivating appeal to audiences ranging from curious teenagers to professional mathematicians? The answer lies in the delicate balance between what we do and dont know about her real life, along with the extraordinary historical and mathematical circumstances that coalesced with her stranger-than- ction initiati...
متن کاملLargest known twin primes and Sophie Germain primes
The numbers 242206083 · 238880 ± 1 are twin primes. The number p = 2375063906985 · 219380 − 1 is a Sophie Germain prime, i.e. p and 2p + 1 are both primes. For p = 4610194180515 · 25056 − 1, the numbers p, p + 2 and 2p + 1 are all primes. In the first days of October, 1995, Harvey Dubner [4] found the largest known twin primes with 5129 decimal digits. (Our earlier twin prime record was 6970538...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2011 شماره
صفحات -
تاریخ انتشار 2011